A secure multicast protocol based on pairings on elliptic curves
نویسندگان
چکیده
The aim of this paper is to introduce a protocol for multicast distribution of secrets providing perfect forward and backward secrecy. The protocol is based on pairings on elliptic curves and has low cost communications and key storage. It is shown how this protocol improves some alternatives existing for real time communications. Keywords—Information security, multicast communications, elliptic curves cryptography, pairings on elliptic curves, hash function.
منابع مشابه
Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملEfficient Key Agreement for Large and Dynamic Multicast Groups
Secure multicast represents the core component of many web and multimedia applications such as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The main challenges for secure multicast is scalability, efficiency and authenticity. In this paper, we propose a scalable, efficient, authenticated group key agreement scheme for large and dynamic multicast systems. The p...
متن کاملAn Efficient Multi-Message Multi-Receiver Signcryption Scheme with Forward Secrecy on Elliptic Curves
Secure multicast communication has application in growing number of applications. Forward secrecy is of prime importance and insures message con dentiality even long-term private key compromised. We present an e¢ cient construction of multi message multi receiver signcryption with forward secrecy on elliptic curves. It provides con dentiality, integrity, authenticity, non-repudiation, public ve...
متن کامل